Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
نویسندگان
چکیده
منابع مشابه
Fluid limits for many-server systems with reneging
A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan, the Law-of-Large-Numbers many-server asymptotics are characterized as the unique solution to a set of...
متن کاملWaiting Time Analysis of Multi-class Queues with Impatient Customers
In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed ...
متن کاملFluid Limits of Many-servers Queues with Reneging
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time before possible entry into service exceeds the patience time. The dynamics of the system is represented in terms of a pair of measure-valued process...
متن کاملAnalysis of Finite Buffer Markovian Queue with Balking, Reneging and Working Vacations
This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...
متن کاملOptimal control of parallel server systems with many servers in heavy traffic
We consider a parallel server system that consists of several customer classes and server pools in parallel. We propose a simple robust control policy to minimize the total linear holding and reneging costs. We show that this policy is asymptotically optimal under the many-server heavy traffic regime for parallel server systems when the service times are only server pool dependent and exponenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 39 شماره
صفحات -
تاریخ انتشار 2014